翻訳と辞書 Words near each other ・ Minimum Fisher information ・ Minimum Foundation Program ・ Minimum funding requirement ・ Minimum gauge railway ・ Minimum harmonisation ・ Minimum ignition energy ・ Minimum information about a microarray experiment ・ Minimum information about a proteomics experiment ・ Minimum Information About a Simulation Experiment ・ Minimum information required in the annotation of models ・ Minimum Information Standards ・ Minimum inhibitory concentration ・ Minimum intelligent signal test ・ Minimum Interval Takeoff ・ Minimum intrusion Grid ・ Minimum k-cut ・ Minimum landing size ・ Minimum lease payments ・ Minimum legal age in Romania ・ Minimum legal ages in Belgium ・ Minimum mass ・ Minimum mean square error ・ Minimum message length ・ Minimum metal mine ・ Minimum municipal obligation ・ Minimum Needs Programme (India) ・ Minimum number of individuals ・ Minimum obstacle clearance altitude ・ Minimum of Two ・ Minimum Off Route Altitude Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Minimum k-cut ： ウィキペディア英語版 Minimum k-cut In mathematics, the minimum ''k''-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to ''k'' connected components. These edges are referred to as ''k''-cut. The goal is to find the minimum-weight ''k''-cut. This partitioning can have applications in VLSI design, data-mining, finite elements and communication in parallel computing. ==Formal definition== Given an undirected graph ''G'' = (''V'', ''E'') with an assignment of weights to the edges ''w'': ''E'' → ''N'' and an integer ''k'' ∈ , partition ''V'' into ''k'' disjoint sets ''F'' =  while minimizing : $\backslash sum\_^\backslash sum\_^k\backslash sum\_\}\; w\; (\; \backslash left\; \backslash \; )$ For a fixed ''k'', the problem is polynomial time solvable in ''O''(|''V''|''k''2).〔.〕 However, the problem is NP-complete if ''k'' is part of the input. It is also NP-complete if we specify $k$ vertices and ask for the minimum $k$-cut which separates these vertices among each of the sets.〔(), which cites ()〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Minimum k-cut」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.